AlciX - Fast and Exact Geometric Analysis of Real Algebraic Plane Curves
نویسندگان
چکیده
An algorithm is presented for the geometric analysis of an algebraic curve f (x,y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the plane, augmented with adjacency information. The adjacency information describes the curve’s topology by a topologically equivalent planar graph. The numerical data in the CAD gives an embedding
منابع مشابه
Bounding and estimating the Hausdorff distance between real space algebraic curves
In this paper, given two real space algebraic curves, not necessarily bounded, whose Hausdorff distance is finite, we provide bounds of their distance. These bounds are related to the distance between the projections of the space curves onto a plane (say, z = 0), and the distance between the z-coordinates of points in the original curves. Using these bounds we provide an estimation method for a...
متن کاملRational quadratic approximation to real algebraic curves
An algorithm is proposed to give a global approximation of an implicit real plane algebraic curve with rational quadratic B-spline curves. The algorithm consists of four steps: topology determination, curve segmentation, segment approximation and curve tracing. Due to the detailed geometric analysis, high accuracy of approximation may be achieved with a small number of quadratic segments. The f...
متن کاملExact symbolic-numeric computation of planar algebraic curves
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition. From a high-level perspective, the overall method splits into two main subroutines, namely an algorithm denoted...
متن کاملGeometric algorithms for algebraic curves and surfaces
This work presents novel geometric algorithms dealing with algebraic curves and surfaces of arbitrary degree. These algorithms are exact and complete – they return the mathematically true result for all input instances. Efficiency is achieved by cutting back expensive symbolic computation and favoring combinatorial and adaptive numerical methods instead, without spoiling exactness in the overal...
متن کاملAnalysis of Real Algebraic Plane Curves
This work describes a new method to compute geometric properties of a real algebraic plane curve of arbitrary degree. These properties contain the topology of the curve as well as the location of singular points and vertical asymptotes. The algorithm is based on the Bitstream Descartes method (Eigenwillig et al.: “A Descartes Algorithm for Polynomials with Bit-Stream Coefficients”, LNCS 3718), ...
متن کامل